Linear time and branching time semantics for recursion with merge
نویسندگان
چکیده
منابع مشابه
Linear Time and Branching Time Semantics for Recursion with Merge
We consider two ways of assigning semantics to a class of statements built from a set of atomic actions (the 'alph.abe:'), by means of sequential composition, nondeterministic choice, recursion and merge (arbitmry interleaving). The first is linear time semantics (LT), stated in terms of trace theory; the semantic domain is the collection of all closed sets of finite and inftnite words. The sec...
متن کاملTowards Bialgebraic Semantics for the Linear Time - Branching Time Spectrum
Process algebra, e.g. CSP, offers different semantical observations (e.g. traces, failures, divergences) on a single syntactical system description. These observations are either computed algebraically from the process syntax, or “extracted” from a single operational model. Bialgebras capture both approaches in one framework and characterize their equivalence; however, due to use of finality, l...
متن کاملUnifying the Linear Time-Branching Time Spectrum of Process Semantics
Van Glabbeek’s linear time-branching time spectrum is one of the most relevant work on comparative study on process semantics, in which semantics are partially ordered by their discrimination power. In this paper we bring forward a refinement of this classification and show how the process semantics can be dealt with in a uniform way: based on the very natural concept of constrained simulation ...
متن کاملLinear, Branching Time and Joint Closure Semantics for Temporal Logic
Temporal logic can be used to describe processes: their behaviour is characterized by a set of temporal models axiomatized by a temporal theory. Two types of models are most often used for this purpose: linear and branching time models. In this paper a third approach, based on socalled joint closure models, is studied using models which incorporate all possible behaviour in one model. Relations...
متن کاملTransition Semantics for Branching Time
In this paper we develop a novel propositional semantics based on the framework of branching time. The basic idea is to replace the moment-history pairs employed as parameters of truth in the standard Ockhamist semantics by pairs consisting of a moment and a consistent, downward closed set of so-called transitions. Whereas histories represent complete possible courses of events, sets of transit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1984
ISSN: 0304-3975
DOI: 10.1016/0304-3975(84)90114-2